Resistant Sets in the Unit Hypercube

Ideal matrices and clutters are prevalent in combinatorial optimization, ranging from balanced matrices, of T-joins, to rooted arborescences. Most the known examples ideal nature. In this paper, rendered by recently developed theory cuboids, we provide a different class clutters, one that is geometric The advantage new it allows for infinitely many minimally nonpacking clutters. We characterize densest class. Using tools developed, then verify replication conjecture